Provably Improving Election Verifiability in Belenios
نویسندگان
چکیده
Belenios is an online voting system that provides a strong notion of election verifiability, where no single party has to be trusted, and security holds as soon either the registrar or server honest. It was formally proved secure, making assumption further ballots are cast on bulletin board after voters verified their ballots. In practice, however, revoting allowed can verify anytime. This gap between formal proofs use in practice leaves open space for attacks, been shown recently. this paper we make two simple additions prove new version satisfies expected verifiability properties. Our automatically performed with Tamarin prover, under vote at most four times.
منابع مشابه
Election Verifiability in Electronic Voting Protocols
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of boolean tests which can be performed on the data produced by an election. The definition distinguishes three aspects of verifiability: individual, universal and eligibility verifiability. It also allows us to determine ...
متن کاملVoter Verifiability in Homomorphic Election Schemes
Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...
متن کاملTowards Automatic Analysis of Election Verifiability Properties
We present a symbolic definition that captures some cases of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the software tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifi...
متن کاملElection verifiability in electronic voting protocols (Preliminary version)
We present a symbolic definition of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifiability. It also allows us to dete...
متن کاملRobust Receipt-Free Election System with Ballot Secrecy and Verifiability
For most elections, receipt-freeness is important – voters are unable to prove to others on how they voted, in order to prevent vote-buying. Many existing receipt-free electronic voting systems are not practical enough as they require voters to participate in the tallying phase (i.e. do not satisfy the vote-and-go requirement), or have no mechanism for the voters to verify whether their votes h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86942-7_1